Extremal theory for convex matchings in convex geometric graphs
نویسندگان
چکیده
منابع مشابه
Dynamic Matchings in Convex Bipartite Graphs
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching in sub-linear time per operation, even in the amortized sense. Despite this difficulty, we develop ...
متن کاملMoore Graphs and Cycles Are Extremal Graphs for Convex Cycles
Let ρ(G) denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 ≤ g ≤ n. It is proved that ρ(G) ≤ ng (m−n+ 1) and that equality holds if and only if G is an even cycle or a Moore graph. The equality also holds for a possible Moore graph of diameter 2 and degree 57 thus giving a new characterization of Moore graphs.
متن کاملGeometric graphs on convex point sets
In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the framework of convex point sets, we also focus on a generalized version of Gabriel graphs known as locally Gabriel graphs or LGGs. LGGs can also be seen as th...
متن کاملConvex geometric tools in information theory
Convex Geometric Tools in Information Theory by Varun Suhas Jog Doctor of Philosophy in Engineering — Electrical Engineering and Computer Sciences University of California, Berkeley Professor Venkat Anantharam, Chair The areas of information theory and geometry mirror each other in remarkable ways, with several concepts in geometry having analogues in information theory. These observations prov...
متن کاملExtremal problems for convex polygons
Consider a convex polygon Vn with n sides, perimeter Pn, diameter Dn, area An, sum of distances between vertices Sn and widthWn. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1996
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02717731